Matching and partially-matching DNA profiles.
نویسنده
چکیده
The DNA profiles of two individuals can have 0, 1, or 2 pairs of alleles that are the same at each locus. These events may be called mismatches, partial matches or matches, respectively, and they have probabilities that depend on the population proportions of alleles as well as the population structure parameter theta. The observed and expected numbers of pairs of individuals with various numbers of matching or partially matching loci in FBI and Australian databases are found to be in good agreement provided theta is set equal to some small value greater than zero. The likelihood ratios for two individuals having a specified degree of relationship versus being unrelated also depend on the numbers of matching and partially matching loci, but even unrelated pairs of individuals can have likelihood ratios that support hypotheses of relatedness. Matching probabilities allow predictions to be made for the sizes of databases that are expected to contain a pair of individuals with high numbers of matching loci. It is very likely that two individuals with at least 9 matching loci among the 13 CODIS loci have already been typed.
منابع مشابه
استفاده از Propensity Score برای همسان سازی نمونه ها در یک مطالعه مورد شاهدی
Background and Aim: Case-Control studies provide evidence in the area of health. Validity and accuracy of such studies depend to a large extent on the similarity (similar distributions) of the case and control groups according to confounding variables. Matching is a method for controlling or eliminating the effects of important confounders. Matching using propensity score has recently been intr...
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملAn Improved Semantic Schema Matching Approach
Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...
متن کاملHow convincing is a matching Y-chromosome profile?
The introduction of forensic autosomal DNA profiles was controversial, but the problems were successfully addressed, and DNA profiling has gone on to revolutionise forensic science. Y-chromosome profiles are valuable when there is a mixture of male-source and female-source DNA, and interest centres on the identity of the male source(s) of the DNA. The problem of evaluating evidential weight is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of forensic sciences
دوره 49 5 شماره
صفحات -
تاریخ انتشار 2004